Information theory: regular low-density parity-check codes from oval designs

Title: Information theory: regular low-density parity-check codes from oval designs
Creator: Weller, Steven R.; Johnson, Sarah J.
Relation: European Transactions on Telecommunications Vol. 14, Issue 5, p. 399-409
Publisher Link: http://dx.doi.org/10.1002/ett.939
Publisher: John Wiley & Sons / Federazione Italiana Elettrotecnica, Elettronica, Automazione, Informatica e Telecomunicazioni
Resource Type: journal article
Date: 2003
Description: This paper presents a construction of low-density parity-check (LDPC) codes based on the incidence matrices of oval designs. The new LDPC codes have regular parity-check matrices and Tanner graphs free of 4-cycles. Like the finite geometry codes, the codes from oval designs have parity-check matrices with a large proportion of linearly dependent rows and can achieve significantly better minimum distances than equivalent length and rate randomly constructed LDPC codes. Further, by exploiting the resolvability of oval designs, and also by employing column splitting, we are able to produce 4-cycle free LDPC codes for a wide range of code rates and lengths while maintaining code regularity.
Subject: low-density parity-check; incidence matrices of oval designs; Tanner graphs
Identifier: uon:1840
Identifier: http://hdl.handle.net/1959.13/27614
Identifier: ISSN:1124-318X
Reviewed

		Thumbnail	File	Description	Size	Format